Stochastic Asymmetric Blotto Games: Theory and Experimental Evidence

Stochastic asymmetric Blotto games: Some new results

An experimental investigation of colonel blotto games

This article examines behavior in the Colonel Blotto game with asymmetric forces. In this constant-sum game, two players simultaneously allocate their forces across n-battlefields, with the objective of maximizing the expected number of battlefields won. The experimental results support all major theoretical predictions. In the auction treatment, where winning a battlefield is deterministic, th...

Discrete Colonel Blotto and General Lotto games

A class of integer-valued allocation games—“General Lotto games”—is introduced and solved. The results are then applied to analyze the classical discrete “Colonel Blotto games”; in particular, optimal strategies are obtained for all symmetric Colonel Blotto games.

Generalizations of the General Lotto and Colonel Blotto Games∗

In this paper, we generalize the General Lotto game (budget constraints satisfied in expectation) and the Colonel Blotto game (budget constraints hold with probability one) to allow for battlefield valuations that are heterogeneous across battlefields and asymmetric across players, and for the players to have asymmetric resource constraints. We completely characterize Nash equilibrium in the ge...

Pure strategy Nash equilibria in non-zero sum colonel Blotto games

We analyze a Colonel Blotto game in which opposing parties have di¤ering relative intensities (i.e. the game is non-zero sum). We characterize the colonels’ payo¤s that sustain a pure strategy equilibrium and present an algorithm that reaches the equilibrium actions (when they exist). Finally we show that the set of games with a pure strategy equilibria is non-empty. JEL Classi…cation: C72, D7,...